Model-Checking of Infinite Graphs Defined by Graph Grammars

Model-checking of infinite graphs defined by graph grammars

We propose here an algorithm that decides whether a state of an innnite graph deened by a graph grammar satisses a given formula of the alternation-free-calculus. We rst show how graph grammars enable to nitely represent innnite transition systems. In particular, a connection is made between a state of the graph grammar and the states of the innnite graph it represents. We then present succinct...

متن کامل

Model-Checking of CTL on Infinite Kripke Structures Defined by Simple Graph Grammars

We present an algorithm for checking whether an innnite transition system, deened by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL. We rst present the syntax and the semantics of CTL, that are deened with respect to transition systems, labelled with atomic propositions. Then, we show how to adapt the formalism of graph grammars, for expressing such innn...

متن کامل

Model-checking of infinite Kripke structures defined by simple graph grammars

We present an algorithm for checking whether an innnite transition system, deened by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL. We rst present the syntax and the semantics of CTL, that are deened with respect to transition systems, labelled with atomic propositions. Then, we show how to adapt the formalism of graph grammars, for expressing such innn...

متن کامل

Model-checking of Ctl on Infinite Kripke Structures Defined by Simple Graph Grammars Yves-marie Quemener and Thierry Jéron

We present an algorithm for checking whether an innnite transition system, deened by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL. We rst present the syntax and the semantics of CTL, that are deened with respect to transition systems, labelled with atomic propositions. Then, we show how to adapt the formalism of graph grammars, for expressing such innn...

متن کامل

Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO

The formal model of recursive communicating processes (RCPS) is important in practice but does not allows to derive decidability results for model checking questions easily. We focus a partial order representation of RCPS’s execution by graphs—so called run graphs, and suggest an under-approximative verification approach based on a bounded-treewidth requirement. This allows to directly derive p...

متن کامل

Model-Checking of Infinite Graphs Defined by Graph Grammars

نویسندگان

چکیده

منابع مشابه